Monomial Maps and Algebraic Entropy

نویسنده

  • Boris Hasselblatt
چکیده

In this note, we study some of the simplest algebraic self-maps of projective spaces. These maps, which we call monomial maps, are in one-to-one correspondence with nonsingular integer matrices, and are closely related to toral endomorphisms. In Theorem 1 we give a lower bound for the topological entropy of monomial maps and in Theorem 2 we give a formula for algebraic entropy (as defined by Bellon and Viallet). Theorems 1 and 2 imply that the algebraic entropy of a monomial map is always less than or equal to its topological entropy, and that the inequality is strict if the defining matrix has two or more eigenvalues outside the unit circle. Also, Theorem 2 implies that the algebraic entropy of a monomial map is the logarithm of an algebraic integer. This provides new corroboration of Bellon and Viallet’s conjecture that the algebraic entropy of every rational map is the logarithm of an algebraic integer. However, a simple example shows that a more detailed conjecture of Bellon and Viallet is incorrect, in that the sequence of algebraic degrees of the iterates of a rational map from projective space to itself need not satisfy a linear recurrence relation with constant coefficients.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degree-growth of Monomial Maps

For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing algebraic entropy for certain rationalmaps of projective spaces (Theorem6.2) and comparing it with topological entropy (Theorem 5.1). The particular rational maps w...

متن کامل

The Fourier Entropy-Influence conjecture holds for a log-density 1 class of cryptographic Boolean functions

We consider the Fourier Entropy-Influence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI conjecture is true for the functions satisfying the strict avalanche criterion, which forms a subset of asymptotic log–density 1 in the set of all Boolean functions. Further, we prove that the FEI conjecture is satisfied for plateaued Boolean functions, monomial alg...

متن کامل

Varieties with maximum likelihood degree one

We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduced A-discriminantal varieties under monomial maps with finite fibers. The maximum likelihood estimator corresponding to such a variety is Kapranov’s Horn uniformization. This extends Kapranov’s characterization of A-discriminantal hypersurfaces to varieties of arbitrary codimension.

متن کامل

Entropy of algebraic maps

In this paper I give upper bounds for the entropy of algebraic maps in terms of certain homological data induced by their graphs. AMS classification 28D20, 30D05, 54H20 §0. Introduction Let X be a compact metric space and Γ ⊂ X ×X be a closed set. Set

متن کامل

ALGEBRAIC Zd-ACTIONS OF ENTROPY RANK ONE

We investigate algebraic Z-actions of entropy rank one, namely those for which each element has finite entropy. Such actions can be completely described in terms of diagonal actions on products of local fields using standard adelic machinery. This leads to numerous alternative characterizations of entropy rank one, both geometric and algebraic. We then compute the measure entropy of a class of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006